Relating operational and denotational descriptions of [pi]Demos
نویسندگان
چکیده
In previous papers we have presented operational and denotational accounts of the semantics Demos, a small process-oriented simulation language based upon Simula and Demos. The operational semantics provide precise formal descriptions of synchronisations and event list mechanisms and can be used to guide implementations and reason about the execution of a speciic program. The denotational semantics are at a much more abstract level. By abstracting away from distributions and queueing disciplines they make it possible to reason about properties such as deadlock over all possible runs of a model. In this paper we state and prove a formal relationship which holds between the two forms of semantics, namely that any behaviour permitted by the operational deenition can be matched by the denotational account. Hence any properties that can be proved to hold for the behaviours of the denotational account must hold for the limited subset of behaviours observed for the operational account. This permits us to check simulation models expressed in Demos for well-behavedness (no deadlock, livelock, safe, live, etc...) from the model structure once-and-for-all and prior to making any experimental runs.
منابع مشابه
Approaching the Denotational Semantics of Behavioral VHDL Descriptions
In this paper, we present a framework for de ning the formal semantics of behavioral VHDL92 descriptions. We propose a complementary application of denotational and operational semantics. The static semantics is de ned by denotational means. The de nition of the dynamic semantics is based on an operational model using Interval Event Structures.
متن کاملChapter 24 On Relating Denotational and Operational Semantics for Programming Languages with Recursion and Concurrency
متن کامل
Non-interleaving Operational Semantics for the Pi-calculus – technicalities
We provide a non-interleaving operational semantics for the pi-calculus as asynchronous transition systems, which generalizes the standard interleaving structural operational semantics and unfolds to standard, stable prime event structures. We follow the approach taken by Mukund and Nielsen in providing non-interleaving semantics for CCS by infering the so-called prefixing (structural or subjec...
متن کاملRelating Semantic Models of Compensating CSP
Building equivalences between different semantic models of a language strengthens the formal foundation of the language. This paper shows the derivation of denotational semantics from operational semantics of the language cCSP. The aim is to show the correspondence between the operational and trace semantics. We extract traces from operational rules and use structural induction to show the corr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Simul. Pr. Theory
دوره 5 شماره
صفحات -
تاریخ انتشار 1997